On generic structures with a strong amalgamation property
نویسندگان
چکیده
Let L be a finite relational language and α = (αR : R ∈ L) a tuple with 0 < αR ≤ 1 for each R ∈ L. Consider a dimension function δα(A) = |A| − ∑
منابع مشابه
Notes on generalized Fräıssé theory
The purpose of these notes is to give an exposition of Fräıssé theory in an extremely general setting. That is, we drop the hereditary property, instead working with a class of finite structures together with a distinguished class of “strong embeddings” between them. We also weaken the amalgamation property, instead developing the theory with the weak amalgamation property introduced by Kechris...
متن کاملElements of finite order in automorphism groups of homogeneous structures
We study properties of the automorphism groups of Fräıssé limits of classes with certain strong amalgamation properties, including classes with the free amalgamation property and classes of metric spaces. We discuss conditions on a Fräıssé class K that imply that the automorphism group GK of its limit admits generic elements of order n for all n and show that, for many such K, any element of GK...
متن کاملSome remarks on generic structures
We show that the theory of a generic structure constructed from an amalgamation class given by a predimension (as defined by Hrushovski) can be undecidable and have the strict order property. This answers a question of Pourmahdian. By contrast, if the generic is א0-categorical, then we show that it satisfies Shelah’s property NSOP4, but need not satisfy NSOP3.
متن کاملHomomorphic Image Orders on Combinatorial Structures
Combinatorial structures have been considered under various orders, including substructure order and homomorphism order. In this paper, we investigate the homomorphic image order, corresponding to the existence of a surjective homomorphism between two structures. We distinguish between strong and induced forms of the order and explore how they behave in the context of different common combinato...
متن کاملOn Semi/tame Classes of Finite Structures
We modify the definition of robust chains from [25] as an approach to formalizing the Finite Sub-model Property (see [21], for example) from the perspective of a class of finite structures with a generic model (i.e. having the Amalgamation and Joint-embedding properties). We characterize this formulation, which we call super-robustness, modulo a weaker condition (that is closer to the the situa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 74 شماره
صفحات -
تاریخ انتشار 2009